Axiom Schemata as Metalevel Axioms: Model Theory
نویسندگان
چکیده
Logicians frequently use axiom schemata to encode (potentially infinite) sets of sentences with particular syntactic form. In this paper we examine a first-order language in which it is possible to write expressions that both describe sentences and assert the truth of the sentences so described. The effect of adding such expressions to a knowledge base is the same as directly including the set of described sentences.
منابع مشابه
Extending Horn Clause Theories by Reflection Principles
In this paper, we introduce logical reeection as a principled way to empower the representation and reasoning capabilities of logic programming systems. In particular, reeection principles take the role of axiom schemata of a particular form that, once added to a given logic program (the basic theory, or the initial axioms), enlarge the set of consequences sanctioned by those initial axioms. Th...
متن کاملOn characterizations of the fully rational fuzzy choice functions
In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملBASE AXIOMS AND SUBBASE AXIOMS IN M-FUZZIFYING CONVEX SPACES
Based on a completely distributive lattice $M$, base axioms and subbase axioms are introduced in $M$-fuzzifying convex spaces. It is shown that a mapping $mathscr{B}$ (resp. $varphi$) with the base axioms (resp. subbase axioms) can induce a unique $M$-fuzzifying convex structure with $mathscr{B}$ (resp. $varphi$) as its base (resp. subbase). As applications, it is proved that bases and subbase...
متن کاملUpper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of the logic. The existence of a polynomial bound on proof complexity of every statement provable in this logic is a well-known open question. The axiomatization consists of three schemata. We show that any statement prova...
متن کامل